//#include "priority_queue.h"
//using namespace lj;
#include "pq.h"
using namespace bit;
int main()
{
	bit::priority_queue<int, vector<int>, bit::greater<int>> pq;
	pq.push(2);
	pq.push(1);
	pq.push(4);
	pq.push(3);
	pq.push(7);
	pq.push(8);

	while (!pq.empty())
	{
		cout << pq.top() << " ";
		pq.pop();
	}
	cout << endl;
}